Hierarchies of effective descriptive set theory

Notes on Effective Descriptive Set Theory

Intuitionism and Effective Descriptive Set Theory

Randomness via effective descriptive set theory

1.1 Informal introduction to Π1 relations Let 2N denote Cantor space. • A relation B ⊆ N × (2N)r is Π1 if it is obtained from an arithmetical relation by a universal quantification over sets. • If k = 1, r = 0 we have a Π1 set ⊆ N. • If k = 0, r = 1 we have a Π1 class ⊆ 2N. • The relation B is∆1 if both B and its complement are Π1. There is an equivalent representation of Π1 relations where the...

Randomness in effective descriptive set theory

An analog of ML-randomness in the effective descriptive set theory setting is studied, where the r.e. objects are replaced by their Π1 counterparts. We prove the analogs of the Kraft-Chaitin Theorem and Schnorr’s Theorem. In the new setting, while K-trivial sets exist that are not hyper-arithmetical, each low for random set is. Finally we study a very strong yet effective randomness notion: Z i...

Classical descriptive set theory as a refinement of effective descriptive set theory

The (effective) Suslin-Kleene Theorem is obtained as a corollary of a standard proof of the classical Suslin Theorem, by noticing that it is mostly constructive and applying to it a naive realizability interpretation. Effective Descriptive Set Theory is advertized as a refinement of the classical theory of definability (on Polish spaces) developed in the first half of the 20th century, for exam...